Beating Burnashev in delay with noisy feedback

We show how to use a noisy feedback link to yield high-reliability streaming data communications. We demonstrate a strategy that can maintain the best known reliability function (error exponent) in delay, even when the feedback link is noisy. Only the capacity of the feedback channel need be sufficiently large for this result to hold. More detailed characterization of the feedback link, e.g., its error exponent, is not required. We discuss the architectural implications of our result, which are different from those drawn from block-coding paradigms.